Consider n cards that are labeled 1 through n with n an even integer. Thecards are put face down and their ordering starts with card labeled 1 on topthrough card labeled n at the bottom. The cards are top to random shuffled mtimes and placed face down on the table. Starting from the top the cards areguessed without feedback (i.e. whether the guess was correct or false and whatthe guessed card was) one at a time. For m > 4nlog n+cn we find a guessingstrategy that maximizes the expected number of correct guesses.
展开▼
机译：考虑标记为1到n且n为偶数整数的n张卡。将这些卡面朝下放置，并从底部的标记为n的顶部贯穿式卡中标记为1的卡开始订购。卡片在随机洗牌的时间最多，并面朝下放在桌子上。从顶部开始，对卡片进行一次猜测而没有反馈（即，猜测是正确还是错误以及猜测的卡片是什么）。当m> 4nlog n + cn时，我们找到了一种猜测策略，可以最大化预期的正确猜测数。
展开▼
